Convergence of partial sum processes to stable processes with application for aggregation of branching processes

نویسندگان

چکیده

We provide a generalization of Theorem 1 in Bartkiewicz et al. (2011) the sense that we give sufficient conditions for weak convergence finite dimensional distributions partial sum processes strongly stationary sequence to corresponding non-Gaussian stable process instead sums themselves distribution. As an application, describe asymptotic behaviour aggregation independent copies subcritical Galton–Watson branching with regularly varying immigration having index (0,1)∪(1,4/3) so-called iterated case, namely when first taking limit as time scale and then number tend infinity.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Branching-stable point processes

The notion of stability can be generalised to point processes by defining the scaling operation in a randomised way: scaling a configuration by t corresponds to letting such a configuration evolve according to a Markov branching particle system for -log t time. We prove that these are the only stochastic operations satisfying basic associativity and distributivity properties and we thus introdu...

متن کامل

On functional weak convergence for partial sum processes

For a strictly stationary sequence of regularly varying random variables we study functional weak convergence of partial sum processes in the space D[0, 1] with the Skorohod J1 topology. Under the strong mixing condition, we identify necessary and sufficient conditions for such convergence in terms of the corresponding extremal index. We also give conditions under which the regular variation pr...

متن کامل

Application of Markov Processes to the Machine Delays Analysis

Production and non-productive equipment and personnel delays are a critical element of any production system. The frequency and length of delays impact heavily on the production and economic efficiency of these systems. Machining processes in wood industry are particularly vulnerable to productive and non-productive delays. Whereas, traditional manufacturing industries usually operate on homoge...

متن کامل

Partial quicksort and weighted branching processes

In this dissertation we look at different two models of sorting algorithms based on divideand-conquer algorithms. Quicksort algorithm, sort an unsorted array of n distinct elements. Partial Quicksort sorts the l smallest elements in a list of length n. Both stochastic divide-and-conquer algorithms are widely studied. Our algorithm Quicksort on the fly provides online the first smallest, then se...

متن کامل

The Rate of Convergence for Weighted Branching Processes

Let the martingale Wn = Zn mn , where Zn is a weighted branching process and m = E ∑ i Ti is the expected sum of the = factors Ti, converge to some limiting random variable W . We give conditions in terms of the factors such that W belongs to the domain of attraction or to the domain of normal attraction of an = α–stable distribution with 1 < α ≤ 2. Further the rate of convergence of Wn to W is...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Brazilian Journal of Probability and Statistics

سال: 2022

ISSN: ['2317-6199', '0103-0752']

DOI: https://doi.org/10.1214/21-bjps528